Homeomorphism of 2-Complexes is Equivalent to Graph Isomorphism
نویسندگان
چکیده
Whittlesey 12,13,14] gave a criterion which decides when two nite 2-dimensional complexes are homeomorphic. We show that graph isomorphism can be reduced eeciently to 2-complex homeomorphism, and that Whittlesey's criterion can be reduced eeciently to graph isomorphism. Therefore graph isomorphism and 2-complex homeomorphism are polynomial-time equivalent.
منابع مشابه
The Existence of Homeomorphic Subgraphs in Chordal Graphs
We establish conditions for the existence, in a chordal graph, of subgraphs homeomorphic to Kn (n ≥ 3), Km,n (m,n ≥ 2), and wheels Wr (r ≥ 3). Using these results, we develop a simple linear time algorithm for testing planarity of chordal graphs. We also show how these results lead to simple polynomial time algorithms for the Fixed Subgraph Homeomorphism problem on chordal graphs for some speci...
متن کاملCompatible topologies on graphs: An application to graph isomorphism problem complexity
On one hand the graph isomorphism problem (GI) has received considerable attention due to its unresolved complexity status and its many practical applications. On the other hand a notion of compatible topologies on graphs has emerged from digital topology (see [5, 7, 17, 9, 14, 16]). In this article we study GI from the topological point of view. Firstly we explore the poset of compatible topol...
متن کاملThe Homeomorphism Problem for Countable Topological Spaces
We consider the homeomorphism problem for countable topological spaces and investigate its descriptive complexity as an equivalence relation. It is shown that even for countable metric spaces the homeomorphism problem is strictly more complicated than the isomorphism problem for countable graphs and indeed it is not Borel reducible to any orbit equivalence relation induced by a Borel action of ...
متن کاملAn Equivalent Condition for the Reducibilty of Tropical Curves
In response to a recent algorithm for counting the number of isomorphism classes of irreducible tropical curves through 3d+g-1 general points in the plane satisfying certain psi-class conditions by Hannah Markwig and Johannes Rau in [MR08], a method for determining the reducibility of a tropical cruve in terms of it’s dual Newton polytope is required. This paper provides a solution by giving an...
متن کاملThe Complexity of Boolean Matrix Root Computation
We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as directed graphs, we further reveal a connection between Boolean matrix roots and graph isomorphism, which leads to a proof that for a certain subclass of Boolean matrices related to subdivision digraphs, root finding is of the same ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 10 شماره
صفحات -
تاریخ انتشار 2000